# class Test(object):
# #     def __init__(self,n):
# #         self.n = n
# #     def test(self):
# #         n = self.n
# #         a  = n
# #         n = n - 1
# #         return a
# #
# # data = 5
# # b = Test(data)
# #
# # print(b.test())

# nums = [4,1,2,7,5,3,1]
# n = len(nums)
# dp = [0] * (n + 1)
# dp[1] = nums[0]
# for i in  range(2,n + 1):
#     dp[i] = max(dp[i - 1], dp[i - 2] + nums[i - 1])
# print(dp[-1])


# l = len(nums)
# count = 0
# sums = 0
# while count<l:
#     temp = 0
#     sums = sums +nums[count]
#     temp = sums
#     if temp + nums[count+2] < temp +nums[count+3]:
#         sums = sums+nums[count+3]
#         count = count +3
#     else:
#         sums = sums +nums[count+2]
#         count = count + 2
# print(sums)
# a = nums[::2]
# b = nums[::3]
# c = nums[1::2]
# d = nums[1::3]
# print("a为：",a)
# print("b为：",b)
# print("c为：",c)
# print("d为：",d)
# print(max(sum(a), sum(b)))

# a = 19
# # b = str(a)
# # for i in b:
# #     print(i)
# s = "paper"
# t = "title"
# a = [s.index(i) for i in s]
# b = [t.index(i) for i in t]
# print(a)
# print(b)
# import collections
# strs = ["eat", "tea", "tan", "ate", "nat", "bat"]
# ans = collections.defaultdict(list)
# for s in strs:
#     ans[tuple(sorted(s))].append(s)
# print(ans.values())

# class Solution:
#     def permute(self, nums):
#         def backtrack(nums,tem):
#             if nums==[]:
#                 if tem not in res:
#                     res.append(tem[:])
#             else:
#                 for i in range(len(nums)):
#                     tem.append(nums[i])
#                     backtrack(nums[0:i]+nums[i+1:],tem)
#             if tem == []:
#                 return
#             tem.pop()
#
#         res = []
#         tem = []
#         backtrack(nums,tem)
#         return res
#
# data = [1,2,3]
# s = Solution()
# b = s.permute(data)
# print(b)
# nums = [1,2,5,4,3]
# i = len(nums) - 1
# while i > 0 and nums[i] <= nums[i - 1]:
#     i -= 1
# a, b = i, len(nums) - 1
# while a < b:
#     nums[a], nums[b] = nums[b], nums[a]
#     a += 1
#     b -= 1
#
# j = i - 1
# for k in range(i, len(nums)):
#     if nums[k] > nums[j]:
#         nums[j], nums[k] = nums[k], nums[j]
#         break
# print(nums)

# print("test")
#
# if __name__ == '__main__':
#     print("1")
# s = "RLLLLRRRLR"
# res = 0
# cur = 0
# for x in s:
#     if x == 'L':
#         cur -= 1
#     else:
#         cur += 1
#     if cur == 0:
#         res += 1
# print(res)

# coordinates = [[1,1],[2,2],[3,4],[4,5],[5,6],[7,7]]
# n = len(coordinates)
# d = (coordinates[0][1] - coordinates[n - 1][1]) / (coordinates[0][0] - coordinates[n - 1][0])
# for i in range(1,n):
#     dd = (coordinates[0][1] - coordinates[i][1]) / (coordinates[0][0] - coordinates[i][0])
#     if dd != d:
#         print(False)
# print(True)
# a = max(coordinates)
# print(a)
#
# all((coordinates[1][1] - coordinates[0][1]) * (coordinates[i][0] - coordinates[0][0]) == (coordinates[i][1] - coordinates[0][1]) *
#     (coordinates[1][0] - coordinates[0][0]) for i in range(2, len(coordinates)))

# grid = [[1,2,3],[4,5,6],[7,8,9]]
# k = 1
# if k == 0:
#     print(grid)
# m = len(grid)
# n = len(grid[0])
# trow = []
# for row in grid:
#     trow += row
# tk = len(trow)
# k = k % tk
# nrow = trow[tk - k:tk] + trow[0:tk - k]
# for i in range(m):
#     for j in range(n):
#         grid[i][j] = nrow[i * n + j]
# print(grid)


# n = 2
# m = 2
# indices = [[1,1],[0,0]]
# ans = n + m - 2
# l = len(indices)
# a = []
# b = []
# a.append(indices[0][0])
# b.append(indices[0][1])
# for i in range(1, l):
#     if indices[i][0] not in a:
#         ans = ans + m - len(b)
#         a.append(indices[i][0])
#         if indices[i][1] not in b:
#             ans = ans + n - len(a)
#             b.append(indices[i][1])
#         else:
#             ans = ans - n + len(a)
#     else:
#         ans = ans - m + len(b)
#         if indices[i][1] not in b:
#             ans = ans + n
#             b.append(indices[i][1])
#         else:
#             ans = ans - n
# print(ans)
# class T(object):
#     def test(self,c,d):
#         a = c+d
#         b = c - d
#         return a,b
#
# A = T()
# b = A.test(5,3)
# print(b)

你好 = 10
print(你好)